Probabilistic Instruction Execution: The MAYBE Predicate
نویسندگان
چکیده
Instruction predication is an attractive method for improving the throughput of a pipelined processor by eliminating the adverse side-effects of branch operations. Although it may alone help to prevent simple power analysis (SPA) type attacks by masking branch execution, predication systems can also be augmented to allow a building block for defence against more powerful cryptographic attacks. We present the idea of probabilistic instruction execution, that is execution of an instruction based on some random probability, as a method for implementing highlevel constructs for implementing algorithmic defences against differential power analysis (DPA).
منابع مشابه
Modified Architectural Support for predicate execution of Instruction level parallelism
Utilizing speculative execution alone to extract instruction level parallelism in the presence of branches has performance limitation .The fundamental limitation is that speculation eliminates dependencies between instructions and branches, but does not remove the branches themselves. To overcome this drawback, predicate execution is investigated. Predicate or guarded execution enables a compil...
متن کاملEnhancing Multiple - Path
Speculative execution has long been used as an approach to exploit instruction level par-allelism across basic block boundaries. Most existing speculative execution techniques only support speculating along single control path, and heavily rely on branch prediction to choose the right control path. In this paper, we propose an extended predicated execution mechanism, called predicate shifting, ...
متن کاملHierarchical Control Prediction: Support for Aggressive Predication
Predication of control edges has the potential advantages of improving fetch bandwidth and reducing branch mispredictions. However, heavily predicated code in out-of-order processors can lose significant performance by deferring resolution of the predicates until they are executed, whereas in nonpredicated code those control arcs would have remained as branches, and would be resolved immediatel...
متن کاملFuture Branches { beyond Speculative Execution
The performance and hardware complexity of superscalar architectures is hindered by conditional branch instructions. When conditional branches are encountered in a program, the instruction fetch unit must rapidly predict the branch predicate and begin speculatively fetching instructions with no loss of instruction throughput. Speculative execution increases hardware cost, since speculative inst...
متن کاملProbabilistic Thread Algebra
We add probabilistic features to basic thread algebra and its extensions with thread-service interaction and strategic interleaving. Here, threads represent the behaviours produced by instruction sequences under execution and services represent the behaviours exhibited by the components of execution environments of instruction sequences. In a paper concerned with probabilistic instruction seque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003